#include<bits/stdc++.h>
#define ll long long
#define L x<<1
#define R x<<1|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,n
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(int x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=2e7+5,M=1e5+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,fac[N],iv[N],ans;
inline int C(int x,int y){
	if(x<0||y<0||x<y)return 0;
	return mul(fac[x],mul(iv[y],iv[x-y]));
}
inline void prep(){
	fac[0]=1;
	repn(i)fac[i]=mul(fac[i-1],i);
	iv[n]=INV(fac[n]);
	per(i,n-1,0)iv[i]=mul(iv[i+1],i+1);
}
int g[M][6];
inline int calc(int n){
	return mul(g[m][n],iv[n]);
}
inline void Main(){
	n=read(),m=read(),prep();
	ans=1;
	g[1][1]=1;
	rep(i,2,m){
		repn(j)rep(k,j-1,j){
			add(g[i][j],mul(g[i-1][k],j));
		}
	}
	rep(i,2,n)add(ans,calc(i));
	cout <<ans;
}
signed main(){
	freopen("drama.in","r",stdin);
	freopen("drama.out","w",stdout);
	int T=1;
	while(T--)Main();
	return 0;
}	